package queuedemo;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * Date: 2025-01-25
 * Time: 12:08
 */
public class MyCircularQueue2 {
    public int[] elem;
    public int front;
    public int rear;

    public boolean isFull;

    public MyCircularQueue2(int k) {
        elem = new int[k];
        isFull = false;
    }

    public boolean enQueue(int value) {
        if (isFull()) {
            return false;
        }
        elem[rear] = value;
        rear = (rear + 1) % elem.length;
        if (rear == front){
            isFull = true;
        }
        return true;
    }

    public boolean deQueue() {
        if (isEmpty()) {
            return false;
        }
        front = (front + 1) % elem.length;
        isFull = false;
        return true;
    }

    public int Front() {
        if (isEmpty()) {
            return -1;
        }

        return elem[front];
    }

    public int Rear() {
        if (isEmpty()) {
            return -1;
        }
        int index = rear == 0 ? elem.length - 1 : rear - 1;
        return elem[rear - 1];
    }

    public boolean isEmpty() {
        return !isFull && front == rear;
    }

    public boolean isFull() {
        return isFull;
    }
}
